A Novel Binary Feature from Intensity Difference Quantization between Random Sample of Points
نویسندگان
چکیده
With the explosive growth of web multimedia data, how to manage and retrieval the web-scale data more efficiently has become a urgent problem, which expects more efficient low-level feature with low computation. This pressing need brings a huge challenge to the conventional feature. It is urgent to make descriptor more compact and faster and meanwhile remain robust to many different kinds of image transformation. To this end, this paper proposed one kind of fast descriptor for local patch. It consists of a string of binary bits which are derived from the intensity difference quantization (IDQ) between pixel pairs which are chosen according to a fixed random sample pattern, so we called it DIDQ (descriptor based on IDQ). Our experiments show that DIDQ is very fast to be computed and also more robust than the other existing binary represented features.
منابع مشابه
Local gradient pattern - A novel feature representation for facial expression recognition
Many researchers adopt Local Binary Pattern for pattern analysis. However, the long histogram created by Local Binary Pattern is not suitable for large-scale facial database. This paper presents a simple facial pattern descriptor for facial expression recognition. Local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region...
متن کاملDPML-Risk: An Efficient Algorithm for Image Registration
Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...
متن کاملFast Search for MPEG Video Clips Using Adjacent Pixel Intensity Difference Quantization Histogram Feature
In this paper, we propose a novel fast search algorithm for short MPEG video clips from video database. This algorithm is based on the adjacent pixel intensity difference quantization (APIDQ) algorithm, which had been reliably applied to human face recognition previously. An APIDQ histogram is utilized as the feature vector of the frame image. Instead of fully decompressed video frames, partial...
متن کاملAngular Quantization-based Binary Codes for Fast Similarity Search
This paper focuses on the problem of learning binary codes for efficient retrieval of high-dimensional non-negative data that arises in vision and text applications where counts or frequencies are used as features. The similarity of such feature vectors is commonly measured using the cosine of the angle between them. In this work, we introduce a novel angular quantization-based binary coding (A...
متن کاملDetection and Classification of Heart Premature Contractions via α-Level Binary Neyman-Pearson Radius Test: A Comparative Study
The aim of this study is to introduce a new methodology for isolation of ectopic rhythms of ambulatory electrocardiogram (ECG) holter data via appropriate statistical analyses imposing reasonable computational burden. First, the events of the ECG signal are detected and delineated using a robust wavelet-based algorithm. Then, using Binary Neyman-Pearson Radius test, an appropriate classifie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013